Numerical identification of diffusivity coefficient and initial condition by discrete mollification
نویسندگان
چکیده
منابع مشابه
Numerical Condition of Discrete Wavelet Transforms∗
The recursive algorithm of a (fast) discrete wavelet transform, as well as its generalizations, can be described as repeated applications of block-Toeplitz operators or, in the case of periodized wavelets, multiplications by block circulant matrices. Singular values of a block circulant matrix are the singular values of some matrix trigonometric series evaluated at certain points. The norm of a...
متن کاملNumerical identification of a Robin coefficient in parabolic problems
This paper studies a regularization approach for an inverse problem of estimating a spatially-and-temporally dependent Robin coefficient arising in the analysis of convective heat transfer. The parameter-to-state map is analyzed, especially a differentiability result is established. A regularization approach is proposed, and the properties, e.g., existence and optimality system, of the function...
متن کاملNumerical Identification of a Spatially Varying Diffusion Coefficient
We consider the inverse problem of identifying a spatially varying diffusion coefficient on the basis of an observed solution to the forward problem. Under appropriate conditions, this inverse problem can be solved as a first order hyperbolic problem in the unknown coefficient. We provide a modified upwind difference scheme for this hyperbolic problem and prove that its convergence rate is 0(h)...
متن کاملIdentification of Search Models with Initial Condition Problems
This paper extends previous work on the identification of search models in which observed worker productivity is imperfectly observed. In particular, it establishes that these models remain identified even when employment histories are left-censored (i.e. we do not get to follow workers from their initial job out of unemployment), as well as when workers set different reservation wages from one...
متن کاملNumerical Differentiation of 2D Functions by a Mollification Method Based on Legendre Expansion
In this paper, we consider numerical differentiation of bivariate functions when a set of noisy data is given. A mollification method based on spanned by Legendre polynomials is proposed and the mollification parameter is chosen by a discrepancy principle. The theoretical analyses show that the smoother the genuine solution, the higher the convergence rates of the numerical solution. To get a p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1995
ISSN: 0898-1221
DOI: 10.1016/0898-1221(95)00173-v